Circuit Partitioning for FPGAs by the Optimal Circuit Reduction Method
نویسندگان
چکیده
منابع مشابه
Circuit Partitioning for Dynamically Recon gurable FPGAs
Dynamically recon gurable FPGAs have the potential to dramatically improve logic density by time-sharing a physical FPGA device. This paper presents a networkow based partitioning algorithm for dynamically recon gurable FPGAs based on the architecture in [2]. Experiments show that our approach outperforms the enhanced force-directed scheduling method in [2] in terms of communication cost.
متن کاملIR-drop Reduction Through Combinational Circuit Partitioning
IR-drop problem is becoming more and more important. Previous works dealing with power/ground (P/G) network peak current reduction to reduce the IR-drop problem only focus on synchronous sequential logic circuits which consider the combinational parts as unchangeable [4],[5]. However, some large combinational circuits which work alone in one clock cycle can create large current peaks and induce...
متن کاملStreaming Reduction Circuit for Sparse Matrix Vector Multiplication in FPGAs
Floating point sparse matrix vector multiplications (SM×V) are kernel operations for many scientific algorithms. In these algorithms, the SM×V is often responsible for the biggest part of the processing time. It is thus important to speed-up the processing of the SM×V. To use an FPGA to do this is a logical choice since FPGAs are inherently parallel. The core operation of the SM×V is to reduce ...
متن کاملGenetic Algorithm for Circuit Partitioning
In computer-aided logic design, partitioning is the task of clustering circuit elements into groups so that a given objective function is optimized with respect to a set of design constraints. In this paper we present a genetic algorithm for the circuit partitioning problem. The objective of the proposed algorithm is not only to balance the size of the two portions, but also to evenly distribut...
متن کاملCircuit Partitioning Using Atabu
Tabu Search is a simple combinatorial optimization strategy that has been applied with great success in applications ranging from graph coloring to scheduling and space planning. This paper describes the application of the Tabu Searchh1] heuristic to the circuit partitioning problem. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 2000
ISSN: 1065-514X,1563-5171
DOI: 10.1155/2000/58485